Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("Gottlob, Georg")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 138

  • Page / 6
Export

Selection :

  • and

On minimal constraint networksGOTTLOB, Georg.Artificial intelligence (General ed.). 2012, Vol 191-12, pp 42-60, issn 0004-3702, 19 p.Article

Decomposing Combinatorial Auctions and Set Packing ProblemsGOTTLOB, Georg; GRECO, Gianluigi.Journal of the Association for Computing Machinery. 2013, Vol 60, Num 4, issn 0004-5411, 24.1-24.39Article

Efficient Core Computation in Data ExchangeGOTTLOB, Georg; NASH, Alan.Journal of the Association for Computing Machinery. 2008, Vol 55, Num 2, issn 0004-5411, 9.1-9.49Article

Working with ARMs: complexity results on atomic representations of Herbrand modelsGOTTLOB, Georg; PICHLER, Reinhard.Information and computation (Print). 2001, Vol 165, Num 2, pp 183-207, issn 0890-5401Article

A formal comparison of visual web wrapper generatorsGOTTLOB, Georg; KOCH, Christoph.Lecture notes in computer science. 2006, pp 30-48, issn 0302-9743, isbn 3-540-31198-X, 1Vol, 19 p.Conference Paper

Hypergraphs in model checking: Acyclicity and hypertree-width versus clique-widthGOTTLOB, Georg; PICHLER, Reinhard.SIAM journal on computing (Print). 2004, Vol 33, Num 2, pp 351-378, issn 0097-5397, 28 p.Article

A logical approach to multicut problemsGOTTLOB, Georg; LEE, Stephanie Tien.Information processing letters. 2007, Vol 103, Num 4, pp 136-141, issn 0020-0190, 6 p.Article

Propositional default logics made easier: Computational complexity of model checkingBAUMGARTNER, Robert; GOTTLOB, Georg.Theoretical computer science. 2002, Vol 289, Num 1, pp 591-627, issn 0304-3975, 37 p.Article

Complexity results for some eigenvector problemsEITER, Thomas; GOTTLOB, Georg.International journal of computer mathematics. 2000, Vol 76, Num 1, pp 59-74, issn 0020-7160Article

Schema Mapping Discovery from Data InstancesGOTTLOB, Georg; SENELLART, Pierre.Journal of the Association for Computing Machinery. 2010, Vol 57, Num 2, issn 0004-5411, B1-B37Article

Reasoning under minimal upper bounds in propositional logicEITE, Thomas; GOTTLOB, Georg.Theoretical computer science. 2006, Vol 369, Num 1-3, pp 82-115, issn 0304-3975, 34 p.Article

CSL '98 : computer science logic (Brno, 24-28 August 1998)Gottlob, Georg; Grandjean, Etienne; Seyr, Katrin et al.Lecture notes in computer science. 1999, issn 0302-9743, isbn 3-540-65922-6, X, 429 p, isbn 3-540-65922-6Conference Proceedings

Computational logic and proof theory (Vienna, August 25-29, 1997)Gottlob, Georg; Leitsch, Alexander; Mundici, Daniele et al.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63385-5, VIII, 348 p, isbn 3-540-63385-5Conference Proceedings

Sketch-as-proofPREINING, N.Lecture notes in computer science. 1997, pp 264-277, issn 0302-9743, isbn 3-540-63385-5Conference Paper

ADBIS 2004 : advances in databases and information systems (Budapest, 22-25 September 2004)Benczur, Andras; Demetrovics, Janos; Gottlob, Georg et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23243-5, XI, 422 p, isbn 3-540-23243-5Conference Proceedings

Making more out of an inconsistent databaseWIJSEN, Jef.Lecture notes in computer science. 2004, pp 291-305, issn 0302-9743, isbn 3-540-23243-5, 15 p.Conference Paper

On the complexity of H-subsumptionPICHLER, R.Lecture notes in computer science. 1999, pp 355-371, issn 0302-9743, isbn 3-540-65922-6Conference Paper

Logical relations and inductive/coinductive typesALTENKIRCH, T.Lecture notes in computer science. 1999, pp 343-354, issn 0302-9743, isbn 3-540-65922-6Conference Paper

Trakhtenbrot theorem and fuzzy logicHAJEK, P.Lecture notes in computer science. 1999, pp 1-8, issn 0302-9743, isbn 3-540-65922-6Conference Paper

Upper bounds for standardizations and an applicationXI, H.Lecture notes in computer science. 1997, pp 335-348, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Monotone fixed-point types and strong normalizationMATTHES, R.Lecture notes in computer science. 1999, pp 298-312, issn 0302-9743, isbn 3-540-65922-6Conference Paper

Subtyping functional+nonempty record typesVOROBYOV, S.Lecture notes in computer science. 1999, pp 283-297, issn 0302-9743, isbn 3-540-65922-6Conference Paper

Explaining Gentzen's consistency proof within infinitary proof theoryBUCHHOLZ, W.Lecture notes in computer science. 1997, pp 4-17, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Comparing computational representations of Herbrand modelsMATZINGER, R.Lecture notes in computer science. 1997, pp 203-218, issn 0302-9743, isbn 3-540-63385-5Conference Paper

A high-level language for specifying XML data transformationsPANKOWSKI, Tadeusz.Lecture notes in computer science. 2004, pp 159-172, issn 0302-9743, isbn 3-540-23243-5, 14 p.Conference Paper

  • Page / 6